Slicing the Sierpiński gasket

Hanoi attractors and the Sierpiński gasket

The famous game Towers of Hanoi is related with a family of so–called Hanoi–graphs. We regard these non self–similar graphs as geometrical objects and obtain a sequence of fractals (HGα)α converging to the Sierpiński gasket which is one of the best studied fractals. It is shown that this convergence holds not only with respect to the Hausdorff distance, but that also Hausdorff dimension does co...

Sierpiński gasket graphs and some of their properties

Block-Space GPU Mapping for Embedded Sierpiński Gasket Fractals

This work studies the problem of GPU thread mapping for a Sierpiński gasket fractal embedded in a discrete Euclidean space of n × n. A block-space map λ : Z2E 7→ Z 2 F is proposed, from Euclidean parallel space E to embedded fractal space F, that maps in O(log 2 log 2 (n)) time and uses no more than O(n) threads with H ≈ 1.58... being the Hausdorff dimension, making it parallel space efficient....

Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket

As a fundamental subject of theoretical computer science, the maximum independent set (MIS) problem not only is of purely theoretical interest, but also has found wide applications in various fields. However, for a general graph determining the size of a MIS is NP-hard, and exact computation of the number of all MISs is even more difficult. It is thus of significant interest to seek special gra...

Sampling on the Sierpinski Gasket